Efficient parallel solutions to some geometric problems

Efficient Parallel Solutions to Some Geometric Problems

This paper presents new algorithms for solving some geometric problems on a shared memory parallel computer j where concurrent reads are allowed but no two processors can simultaneously attempt to write in the same memory location. The algorithms are quite different from known sequential algorithms, and are based on the use of a new parallel divide-and-conquer technique. One of our results is a...

Some Scaleable Parallel Algorithms for Geometric Problems

This paper considers a variety of geometric problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with (np ) local memory each (i.e., ( n p ) memory cells of (logn) bits apiece), where the processors are connected to an arbitrary interconnection network. It introduces e cient scaleable parallel algorithms for a number of geometric problems includ...

Parallel Randomized Techniques for Some Fundamental Geometric Problems: A Survey

Solutions to Some More Problems

Inherently Parallel Geometric Problems

A new computational paradigm is described which o ers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to given mathematical constraints and hence do not depend on external circumstances to achieve superlinear performance. The focus here is on geometric transformations. Given a geometric object A with...